Time bounded random access machines

Neural Random-Access Machines

In this paper, we propose and investigate a new neural network architecture called Neural Random Access Machine. It can manipulate and dereference pointers to an external variable-size random-access memory. The model is trained from pure input-output examples using backpropagation. We evaluate the new model on a number of simple algorithmic tasks whose solutions require pointer manipulation and...

Relative Cost Random Access Machines

On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape

We investigate probabilistic space-bounded machines that are allowed to make multiple passes over the random tape. As our main contribution, we establish a connection between derandomization of such probabilistic space-bounded classes to the derandomization of probabilistic time-bounded classes. Our main result is the following. For some integer k > 0, if all the languages accepted by boundeder...

Fast Simulation of Turing Machines by Random Access Machines

Continuous-time random walks on bounded domains.

A useful perspective to take when studying anomalous diffusion processes is that of a continuous-time random walk and its associated generalized master equation. We derive the generalized master equations for continuous-time random walks that are restricted to a bounded domain and compare numerical solutions with kernel-density estimates of the probability-density function computed from simulat...